Modified descent-projection method for solving variational inequalities
نویسندگان
چکیده
In this paper, we propose a modified descent-projection method for solving variational inequalities. The method makes use of a descent direction to produce the new iterate and can be viewed as an improvement of the descent-projection method by using a new step size. Under certain conditions, the global convergence of the proposed method is proved. In order to demonstrate the efficiency of the proposed method, we provide numerical results for a traffic equilibrium problems. 2007 Elsevier Inc. All rights reserved.
منابع مشابه
A Descent-projection Method for Solving Monotone Structured Variational Inequalities
In this paper, a new descent-projection method with a new search direction for monotone structured variational inequalities is proposed. The method is simple, which needs only projections and some function evaluations, so its computational load is very tiny. Under mild conditions on the problem’s data, the method is proved to converges globally. Some preliminary computational results are also r...
متن کاملEfficient implementation of a modified and relaxed hybrid steepest-descent method for a type of variational inequality
To reduce the difficulty and complexity in computing the projection from a real Hilbert space onto a nonempty closed convex subset, researchers have provided a hybrid steepest-descent method for solving VI(F,K) and a subsequent three-step relaxed version of this method. In a previous study, the latter was used to develop a modified and relaxed hybrid steepest-descent (MRHSD) method. However, ch...
متن کاملOn LQP alternating direction method for solving variational inequality problems with separable structure
In this paper, we proposed a logarithmic-quadratic proximal alternating direction method for structured variational inequalities. The new iterate is obtained by a convex combination of the previous point and the one generated by a projection-type method along a new descent direction. Global convergence of the new method is proved under certain assumptions. We also reported some numerical result...
متن کاملNew Implicit Method for General Nonconvex Variational Inequalities
In this paper, we suggest and analyze a new implicit iterative projection method for solving general nonconvex variational inequalities. We prove that the new implicit method is equivalent to the modified projection method. Using this alternative equivalence between the implicit method and the modified projection, we prove that the convergence of the new implicit method requires only the partia...
متن کاملModified Descent Methodsfor Solving the Monotonevariational
Recently, Fukushima proposed a diierentiable optimization framework for solving strictly monotone and continuously diierentiable variational inequalities. The main result of this paper is to show that Fukushima's results can be extended to monotone (not necessarily strictly monotone) and Lipschitz continuous (not necessarily continuously diierentiable) variational inequalities, if one is willin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 190 شماره
صفحات -
تاریخ انتشار 2007